Archery Algorithm: A Novel Stochastic Optimization Algorithm for Solving Optimization Problems

نویسندگان

چکیده

Finding a suitable solution to an optimization problem designed in science is major challenge. Therefore, these must be addressed utilizing proper approaches. Based on random search space, algorithms can find acceptable solutions problems. Archery Algorithm (AA) new stochastic approach for addressing problems that discussed this study. The fundamental idea of developing the suggested AA imitate archer's shooting behavior toward target panel. proposed algorithm updates location each member population dimension space by randomly marked archer. mathematically described, and its capacity solve evaluated twenty-three distinct types objective functions. Furthermore, algorithm's performance compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic grey wolf particle swarm whale gravitational tunicate algorithm. According simulation findings, has good tackle issues both unimodal multimodal scenarios, it give adequate quasi-optimal analysis comparison competing algorithms’ with demonstrates superiority competitiveness AA.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

Flying Squirrel Optimizer (FSO): A novel SI-based optimization algorithm for engineering problems

This paper provides a novel meta-heuristic optimization algorithm. The behaviors of flying squirrels in the nature are the main inspiration of this research. These behaviors include flying from tree to tree and walking on the ground or on a tree branch to find food. They also contact each other with chirp or squeak. This algorithm is named flying squirrel optimizer (FSO). Two main theories of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.024736